Hardness of Embedding Metric Spaces of Equal Size
نویسندگان
چکیده
We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm to approximate the minimum distortion within a factor of Ω((log n)1/4−δ) for any constant δ > 0, unless NP ⊆ DTIME(n ). We give a simple reduction from the METRIC LABELING problem which was shown to be inapproximable by Chuzhoy and Naor [10].
منابع مشابه
On the Structure of Metric-like Spaces
The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...
متن کاملComputational metric embeddings
We study the problem of computing a low-distortion embedding between two metric spaces. More precisely given an input metric space M we are interested in computing in polynomial time an embedding into a host space M ′ with minimum multiplicative distortion. This problem arises naturally in many applications, including geometric optimization, visualization, multi-dimensional scaling, network spa...
متن کاملLimitations to Fréchet’s Metric Embedding Method
Fréchet’s classical isometric embedding argument has evolved to become a major tool in the study of metric spaces. An important example of a Fréchet embedding is Bourgain’s embedding [4]. The authors have recently shown [2] that for every ε > 0 any n-point metric space contains a subset of size at least n1−ε which embeds into `2 with distortion O ( log(2/ε) ε ) . The embedding used in [2] is no...
متن کاملAmenability, Locally Finite Spaces, and Bi-lipschitz Embeddings
We define the isoperimetric constant for any locally finite metric space and we study the property of having isoperimetric constant equal to zero. This property, called Small Neighborhood property, clearly extends amenability to any locally finite space. Therefore, we start making a comparison between this property and other notions of amenability for locally finite metric spaces that have been...
متن کاملPhishing website detection using weighted feature line embedding
The aim of phishing is tracing the users' s private information without their permission by designing a new website which mimics the trusted website. The specialists of information technology do not agree on a unique definition for the discriminative features that characterizes the phishing websites. Therefore, the number of reliable training samples in phishing detection problems is limited. M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007